Gpcore – a Generic Framework for Genetic Programming
نویسندگان
چکیده
Complex engineering tasks are rarely unique in their solution. The question is not to determine a single solution – it is more to retrieve an optimal solution. Automated, software-based optimization technologies turned out to be a very promising and applicable solution for the class of non-deterministic optimization problems. In this paper a generic framework for the application of genetic programming will be introduced. The framework is based on the Backus-Naur representation, which can be seen as a meta-programming language. According to specific demands on engineering problems, various detail solutions have been evolved in this context. Finally, the application of the developed framework in load identification will be presented. An example of an evolutionary optimization within the analysis of measured data will be given. By means of two encapsulated optimization routines structural responses recorded at instrumented bridges are analyzed to determine gross weights, velocities, axle loads as well as axle spacings of passing vehicles. Most significant aspects of the developed framework will be covered within the example: Problem decomposition, problem space definition based on the meta-language, genotype generation, examples of crucial crossover and mutation operations, fitness evaluation and entire operation of the optimization process.
منابع مشابه
Mathematical Programming Models for Solving Unequal-Sized Facilities Layout Problems - a Generic Search Method
This paper present unequal-sized facilities layout solutions generated by a genetic search program named LADEGA (Layout Design using a Genetic Algorithm). The generalized quadratic assignment problem requiring pre-determined distance and material flow matrices as the input data and the continuous plane model employing a dynamic distance measure and a material flow matrix are discussed. Computa...
متن کاملMultiobjective Imperialist Competitive Evolutionary Algorithm for Solving Nonlinear Constrained Programming Problems
Nonlinear constrained programing problem (NCPP) has been arisen in diverse range of sciences such as portfolio, economic management etc.. In this paper, a multiobjective imperialist competitive evolutionary algorithm for solving NCPP is proposed. Firstly, we transform the NCPP into a biobjective optimization problem. Secondly, in order to improve the diversity of evolution country swarm, and he...
متن کاملAn Integrated Decision Making Model for Manufacturing Cell Formation and Supplier Selection
Optimization of the complete manufacturing and supply process has become a critical ingredient for gaining a competitive advantage. This article provides a unified mathematical framework for modeling manufacturing cell configuration and raw material supplier selection in a two-level supply chain network. The commonly used manufacturing design parameters along with supplier selection and a subco...
متن کاملNew scheduling rules for a dynamic flexible flow line problem with sequence-dependent setup times
In the literature, the application of multi-objective dynamic scheduling problem and simple priority rules are widely studied. Although these rules are not efficient enough due to simplicity and lack of general insight, composite dispatching rules have a very suitable performance because they result from experiments. In this paper, a dynamic flexible flow line problem with sequence-dependent se...
متن کاملA New Model for Location-Allocation Problem within Queuing Framework
This paper proposes a bi-objective model for the facility location problem under a congestion system. The idea of the model is motivated by applications of locating servers in bank automated teller machines (ATMS), communication networks, and so on. This model can be specifically considered for situations in which fixed service facilities are congested by stochastic demand within queueing frame...
متن کامل